منابع مشابه
Generalized Synchronization Trees
[1] J. Ferlez, R. Cleaveland, and S. Marcus. Generalized synchronization trees. In FOSSACS 2014, volume 8412 of Lecture Notes in Computer Science, pages 304–319, Grenoble, France, 2014. Springer-Verlag. [2] Robin Milner. A Calculus of Communicating Systems. Number 92 in Lecture Notes in Computer Science. Springer-Verlag, 1980. [3] Edward Dean Tate Jr, Jessy W. Grizzle, and Huei Peng. Shortest p...
متن کاملAlgebraic Synchronization Trees and Processes
We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isom...
متن کاملContinuous Additive Algebras and Injective Simulations of Synchronization Trees
The (in)equational properties of the least fixed point operation on ( -)continuous functions on ( -)complete partially ordered sets are captured by the axioms of (ordered) iteration algebras, or iteration theories. We show that the inequational laws of the sum operation in conjunction with the least fixed point operation in continuous additive algebras have a finite axiomatization over the ineq...
متن کاملTrees over Infinite Structures and Path Logics with Synchronization
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iteration of a relational structure M in the sense of ShelahStupp. In contrast to classical results, where model-checking is shown decidable for MSO-logic...
متن کاملBisimulation and Hennessy-Milner Logic for Generalized Synchronization Trees
In this work, we develop a generalization of Hennessy-Milner Logic (HML) for Generalized Synchronization Trees (GSTs) that we call Generalized Hennessy Milner Logic (GHML). Importantly, this logic suggests a strong relationship between (weak) bisimulation for GSTs and ordinary bisimulation for Synchronization Trees (STs). We demonstrate that this relationship can be used to define the GST analo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90112-9